Fault-Tolerant Multicast Communication for Multicomputers
نویسندگان
چکیده
We describe fault-tolerant routing of multi-cast messages in mesh-based wormhole-switched multicom-puters. With the proposed techniques, multiple convex faults can be tolerated. The fault information is kept locally| each fault-free processor needs to know the status of the links incident on it only. Furthermore, the proposed techniques are deadlock-and livelock-free and guarantee delivery of messages. In particular, we show that the previously proposed column-path and Hamilton-path based algorithms can be made tolerant to multiple faults using two or three virtual channels per physical channel.
منابع مشابه
Fault-Tolerant Multicasting in Multistage Interconnection Networks
In this paper, we study fault-tolerant multicasting in multistage interconnection networks (MINs) for constructing large-scale multicomputers. In addition to point-to-point routing among processor nodes, efficient multicasting is critical to the performance of multicomputers. This paper presents a new approach to provide fault-tolerance multicasting, which employs the restricted header encoding...
متن کاملFault Tolerant Multicast Communication in Multicomputers
We describe fault tolerant routing of multi cast messages in mesh based wormhole switched multicom puters With the proposed techniques multiple convex faults can be tolerated The fault information is kept locally each fault free processor needs to know the status of the links incident on it only Furthermore the proposed tech niques are deadlock and livelock free and guarantee deliv ery of messa...
متن کاملFault-Tolerant Multicast Routing in the Mesh with No Virtual Channels
This paper addresses the problem of fault-tolerant mul-ticast routing in wormhole-routed multicomputers. We present a new pseudo-Hamiltonian path-based routing methodology for constructing deadlock-free multicast routing algorithms requiring no virtual channels. This technique is applied to construct the rst fault-tolerant multicast routing algorithm for the mesh that requires no virtual channe...
متن کاملA Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...
متن کاملTree-Based Fault-Tolerant Multicast in Multicomputer Networks Using Pipelined Circuit Switching
A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links without requiring nodes to have global fault information. The multicast algorithm is provably deadloc...
متن کامل